A Formal Approach to Service Specification and Matching based on Graph Transformation

نویسندگان

  • Reiko Heckel
  • Alexey Cherchago
  • Marc Lohmann
چکیده

When Web services are composed by linking service providers and requestors, the requestor’s requirements for a ”useful” service have to be matched against the service description offered by the provider. Among other things, service specifications (requirements or descriptions) may contain operation contracts specifying pre-conditions and effects of (required or provided) operations. In this paper we provide a semi-formal, UML-based notation for contracts and contract matching, as well as a formalization of these notions in terms of graph transformation. We establish the desired semantic relation between requestor and provider specifications and prove the soundness of our syntactic notion of matching w.r.t. this relation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Web Service Choreography Verification Using Z Formal Specification

Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...

متن کامل

Specification Matching of Web Services Using Conditional Graph Transformation Rules

The ability of applications to dynamically discover required services is a key problem for Web Services. However, this aspect is not adequately supported by current Web Services standards. It is our objective to develop a formal approach allowing the automation of the discovery process. The approach is based on the matching of requestor’s requirements for a useful service against service descri...

متن کامل

A model for specification, composition and verification of access control policies and its application to web services

Despite significant advances in the access control domain, requirements of new computational environments like web services still raise new challenges. Lack of appropriate method for specification of access control policies (ACPs), composition, verification and analysis of them have all made the access control in the composition of web services a complicated problem. In this paper, a new indepe...

متن کامل

Application of Graph Transformation for Automating Web Service Discovery

The paper represents current achievements of an ongoing research that aims to develop a formal approach supporting an automatic selection of a Web service sought by a requestor. The approach is based on the matching the requestor’s requirements for a ”useful” service against the service description offered by the provider. We focus on the checking behavioral compatibility between operation cont...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 105  شماره 

صفحات  -

تاریخ انتشار 2004